Substring selection for biomedical document classification
نویسندگان
چکیده
منابع مشابه
Biomedical Document Triage Based on Figure Classification
The annotation task in model organism databases is to assign attributes, such as Gene Ontology (GO) codes, to biological entities, such as genes and proteins based on the evidence found in documents or other resources. Document triage precedes an annotation task; it identifies relevant documents that can support the annotation process. Annotation in organism databases involves manual efforts of...
متن کاملA New Document Embedding Method for News Classification
Abstract- Text classification is one of the main tasks of natural language processing (NLP). In this task, documents are classified into pre-defined categories. There is lots of news spreading on the web. A text classifier can categorize news automatically and this facilitates and accelerates access to the news. The first step in text classification is to represent documents in a suitable way t...
متن کاملBag-of-Colors for Biomedical Document Image Classification
The number of biomedical publications has increased noticeably in the last 30 years. Clinicians and medical researchers regularly have unmet information needs but require more time for searching than is usually available to find publications relevant to a clinical situation. The techniques described in this article are used to classify images from the biomedical open access literature into cate...
متن کاملAn Effective General Purpose Approach for Biomedical Document Classification
Automated document classification can be a valuable tool for biomedical tasks that involve large amounts of text. However, in biomedicine, documents that have the desired properties are often rare, and special methods are usually required to address this issue. We propose and evaluate a method of classifying biomedical text documents, optimizing for utility when misclassification costs are high...
متن کاملSubstring Suffix Selection
We study the following substring suffix selection problem: given a substring of a string T of length n, compute its k-th lexicographically smallest suffix. This a natural generalization of the well-known question of computing the maximal suffix of a string, which is a basic ingredient in many other problems. We first revisit two special cases of the problem, introduced by Babenko, Kolesnichenko...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2006
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btl350